Convexity of the Extreme Zeros of Classical Orthogonal Polynomials

نویسنده

  • DIMITAR K. DIMITROV
چکیده

Let Cλ n(x), n = 0, 1, . . . , λ > −1/2, be the ultraspherical (Gegenbauer) polynomials, orthogonal in (−1, 1) with respect to the weight function (1−x2)λ−1/2. Denote by xnk(λ), k = 1, . . . , n, the zeros of Cλ n(x) enumerated in decreasing order. In this short note we prove that, for any n ∈ IN , the product (λ+1)xn1(λ) is a convex function of λ if λ ≥ 0. The result is applied to obtain some inequalities for the largest zeros of Cλ n(x). If xnk(α), k = 1, . . . , n, are the zeros of Laguerre polynomial Ln(x), also enumerated in decreasing order, we prove that xn1(λ)/(α+ 1) is a convex function of α for α > −1.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Monotonicity of Zeros of Orthogonal Laurent Polynomials

Monotonicity of zeros of orthogonal Laurent polynomials associated with a strong distribution with respect to a parameter is discussed. A natural analog of a classical result of A. Markov is proved. Recent results of Ismail and Muldoon based on the Hellman-Feynman theorem are also extended to a monotonicity criterion for zeros of Laurent polynomials. Results concerning the behaviour of extreme ...

متن کامل

On extreme zeros of classical orthogonal polynomials

Let x1 and xk be the least and the largest zeros of the Laguerre or Jacobi polynomial of degree k. We shall establish sharp inequalities of the form x1 < A, xk > B, which are uniform in all the parameters involved. Together with inequalities in the opposite direction, recently obtained by the author, this locates the extreme zeros of classical orthogonal polynomials with the relative precision,...

متن کامل

Convexity of the Extreme Zeros of Gegenbauer and Laguerre Polynomials

Let Cλ n(x), n = 0, 1, . . . , λ > −1/2, be the ultraspherical (Gegenbauer) polynomials, orthogonal in (−1, 1) with respect to the weight function (1−x2)λ−1/2. Denote by xnk(λ), k = 1, . . . , n, the zeros of Cλ n(x) enumerated in decreasing order. In this short note we prove that, for any n ∈ IN , the product (λ+1)xn1(λ) is a convex function of λ if λ ≥ 0. The result is applied to obtain some ...

متن کامل

Bounds for zeros of Meixner and Kravchuk polynomials

The zeros of certain different sequences of orthogonal polynomials interlace in a well-defined way. The study of this phenomenon and the conditions under which it holds lead to a set of points that can be applied as bounds for the extreme zeros of the polynomials. We consider different sequences of the discrete orthogonal Meixner and Kravchuk polynomials and use mixed three term recurrence rela...

متن کامل

Orthogonality and asymptotics of Pseudo-Jacobi polynomials for non-classical parameters

The family of general Jacobi polynomials P (α,β) n where α, β ∈ C can be characterised by complex (nonhermitian) orthogonality relations (cf. [15]). The special subclass of Jacobi polynomials P (α,β) n where α, β ∈ R are classical and the real orthogonality, quasi-orthogonality as well as related properties, such as the behaviour of the n real zeros, have been well studied. There is another spe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001